منابع مشابه
Edge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملNa-edge-connectivity Augmentation Problems by Adding Edges
The network reliability in multi-server environment is measured by the connectivity between a vertex and a vertex subset (NA-connectivity). The problem of augmenting a graph by adding the smallest number of new edges to meet NA-edge(vertex)-connectivity requirement is an important optimization problem that contributes to the network design problem to increase the reliability of a current networ...
متن کاملEdge-Connectivity Augmentation Preserving Simplicity
Given a simple graph G = (V,E), our goal is to find a smallest set F of new edges such that G = (V,E ∪ F ) is k-edge-connected and simple. Recently this problem was shown to be NP-complete. In this paper we prove that if OPT P is high enough—depending on k only—then OPT S = OPT P holds, where OPT S (OPT P ) is the size of an optimal solution of the augmentation problem with (without) the simpli...
متن کاملTight Approximation Algorithm for Connectivity Augmentation Problems
The S-connectivity λG(u, v) of (u, v) in a graph G is the maximum number of uv-paths that no two of them have an edge or a node in S − {u, v} in common. The corresponding Connectivity Augmentation (CA) problem is: given a graph G0 = (V,E0), S ⊆ V , and requirements r(u, v) on V ×V , find a minimum size set F of new edges (any edge is allowed) so that λSG0+F (u, v) ≥ r(u, v) for all u, v ∈ V . E...
متن کاملCombined Connectivity Augmentation and Orientation Problems
Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1987
ISSN: 0022-0000
DOI: 10.1016/0022-0000(87)90038-9